Adjacency on Combinatorial Polyhedra

نویسندگان

  • Tomomi Matsui
  • Sunao Tamura
چکیده

This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the faces of these polytopes. First, we establish two fundamental properties of the equality constrained 0-1 polytopes. This paper deals with the polyhedra satisfying these two fundamental properties. We consider a path on the polyhedron satisfying the condition that for each co-ordinate, the vertices in a path form a monotonic sequence. When one of the end vertices of the path is optimal to an optimization problem de ned on the polyhedron, the associated objective values form a monotonic sequence and the length of the path is bounded by the dimension of the polytope. In a sense, some of the results in this paper are natural extensions of the properties of the set partitioning polytopes showed by Balas and Padberg. However, di erent from the studies of Balas and Padberg, our proofs are not based on the pivot operations. Next, we prove the monotone Hirsch conjecture for the combinatorial polyhedra considered here. In the last section, we show that the monotone Hirsch conjecture is true for all the 0-1 polytopes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Skeletons, Diameters and Volumes of Metric Polyhedra

Abst rac t . We survey and present new geometric and combinatorial propertiez of some polyhedra with application in combinatorial optimization, for example, the max-cut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relm :ons and connectivity of the metric polytope and its relatives. In partic~da...

متن کامل

A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries

Our purpose is to elaborate a theory of planar nets or unfoldings for polyhedra, its generalization and extension to polytopes and to combinatorial polytopes, in terms of morphisms of geometries and the adjacency graph of facets.

متن کامل

On Skeletons , Diameters and Volumesof Metric PolyhedraAntoine DEZA

We survey and present new geometric and combinatorial properties of some polyhedra with application in combinatorial optimization, for example, the max-cut and multicommodity ow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relations and connectivity of the metric polytope and its relatives. In particular, using its la...

متن کامل

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

متن کامل

Ordering of convex polyhedra and the Fedorov algorithm.

A method of naming any convex polyhedron by a numerical code arising from the adjacency matrix of its edge graph has been previously suggested. A polyhedron can be built using its name. Classes of convex n-acra (i.e. n-vertex polyhedra) are strictly (without overlapping) ordered by their names. In this paper the relationship between the Fedorov algorithm to generate the whole combinatorial vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 56  شماره 

صفحات  -

تاریخ انتشار 1995